An Algorithm for the 2D Radix-2 Sliding Window Fourier Transform
نویسندگان
چکیده
We present a new algorithm for the 2D Radix-2 Sliding Window Fourier Transform (SWFT). Our algorithm avoids repeating calculations in overlappingwindows by using a tree representation of the Cooley-Tukey Fast Fourier Transform (FFT). For an N0 × N1 array and n0 = 2m0 × n1 = 2m1 windows, our algorithm takes O(N0N1n0n1) operations, which is faster than taking a 2D FFT in each window. We provide a C implementation of the algorithm, compare ours with existing algorithms, and show how the algorithm extends to higher dimensions.
منابع مشابه
Signal identification in smart composite materials using the two-dimensional fast Fourier transform
Abstract This work is part of an effort to structurally integrate self-sensing functionality into smart composite materials using embedded microsensors and local network communication nodes. Here we address the issue of data management through the development of localized processing algorithms. We demonstrate that the two-dimensional fast Fourier transform (FFT) is a useful algorithm due to its...
متن کاملStructural Health Monitoring of Composite Materials Using the Two Dimensional Fast Fourier Transform
Abstract. This work is part of an effort to develop smart composite materials that monitor their own health using embedded micro-sensors and network communication nodes. Here we address the issue of data management through the development of localized processing algorithms. We demonstrate that the two-dimensional Fast Fourier Transform (FFT) is a useful algorithm due to its hierarchical structu...
متن کاملThe Sliding DFT
The standard method for spectrum analysis in digital signal processing (DSP) is the discrete Fourier transform (DFT), typically implemented using a fast Fourier transform (FFT) algorithm. However, there are applications that require spectrum analysis only over a subset of the N center frequencies of an N-point DFT. A popular, as well as efficient, technique for computing sparse DFT results is t...
متن کاملAn Algorithm for Computing the Radix - 2 n Fast Fourier Transform
In digital signal processing, the Fast Fourier Transform (FFT) is a kind of high efficient method to calculate the discrete Fourier transform (DFT). It cuts the discrete signal sequence which the length is N for different radix sequences to operate using the way of handing back and partition. Currently, the radix-2 FFT algorithm is a popular approach to do the transform work. However, its compu...
متن کاملEfficient Spectral Analysis of Quasi Stationary Time Series
Power Spectral Density (PSD) of quasi-stationary processes can be efficiently estimated using the short time Fourier series (STFT). In this paper, an algorithm has been proposed that computes the PSD of quasi-stationary process efficiently using offline autoregressive model order estimation algorithm, recursive parameter estimation technique and modified sliding window discrete Fourier Transfor...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1707.08213 شماره
صفحات -
تاریخ انتشار 2017